Clearing Algorithms and Network Centrality

Game theoretic network centrality: exact formulas and efficient algorithms

The concept of centrality plays an important role in network analysis. Game theoretic centrality measures have been recently proposed, which are based on computing the Shapley Value (SV) of each node (agent) in a suitably constructed co-operative network game (for example see [1]). However, the naive method of exact computation of SVs takes exponential time in the number of nodes. In this paper...

Centrality and network flow

Centralitymeasures, or at least popular interpretations of thesemeasures,make implicit assumptions about the manner in which traffic flows through a network. For example, some measures count only geodesic paths, apparently assuming that whatever flows through the network only moves along the shortest possible paths. This paper lays out a typology of network flows based on two dimensions of vari...

Variable Quantity Market Clearing Algorithms

Market clearing is the process of matching buy and sell bids in securities markets. The allocative efficiency of such algorithms is important, as the Auctioneer is typically paid a commission on the number of bids matched and the volume of quantity traded. Previous algorithms have concentrated on price issues. This paper presents several market clearing algorithms that focus solely on allocatin...

Online Algorithms for Market Clearing

Online Algorithms for Market Clearing